Optimal parallel algorithms for forest and term matching

Parallel String Matching Algorithms

String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.

Optimal pattern matching algorithms

We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...

Optimal Parallel Randomized Algorithms for . . .

List Homomorphic Parallel Algorithms for Bracket Matching

We present a family of parallel algorithms for simple language recognition problems involving bracket matching. The algorithms are expressed in the Bird-Meertens Formalism, exploiting only list operations which are inherently massively parallel. Our intention is to illustrate the practical eecacy with which such algorithms can be derived and expressed given the support of a well understood theo...

Alternative Algorithms for Bit-Parallel String Matching

We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...